a two-phase variable neighborhood search for solving nonlinear optimal control problems

in this paper, a two-phase algorithm, namely ivns, is proposed for solving nonlinear optimal control problems. in each phase of the algorithm, we use a variable neighborhood search (vns), which performs a uniform distribution in the shaking step and the successive quadratic programming, as the local search step. in the first phase, vns starts with a completely random initial solution of control input values. to increase the accuracy of the solution obtained from the phase 1, some new time nodes are added and the values of the new control inputs are estimated by spline interpolation. next, in the second phase, vns restarts by the solution constructed by the phase 1. the proposed algorithm is implemented on more than 20 well-known benchmarks and real world problems, then the results are compared with some recently proposed algorithms. the numerical results show that ivns can find the best solution on 84% of test problems. also, to compare the ivns with a common vns (when the number of time nodes is same in both phases), a computational study is done. this study shows that ivns needs less computational time with respect to common vns, when the quality of solutions are not different signifcantly.